Semiring-based Constraint Logic Programming Content Areas: Constraint Satisfaction, Automated Reasoning
ثبت نشده
چکیده
We extend the Constraint Logic Programming (CLP) formalism in order to handle semiring-based constraint systems. This allows us to perform in the same language both constraint solving and optimization. In fact, constraint systems based on semirings are able to model both classical constraint solving and more sophisticated features like uncertainty, probability , fuzzyness, and optimization. We then provide this class of languages with three equivalent semantics: model-theoretic, xpoint, and proof-theoretic, in the style of CLP programs.
منابع مشابه
Compiling Semiring-Based Constraints with clp (FD, S)
In some recent works, a general framework for nite domains constraint satisfaction has been deened, where classical CSPs, fuzzy CSPs, weighted CSPs, partial CSPs and others can be easily cast. This framework, based on a semiring structure, allows, under certain conditions , to compute arc-consistency. Restricting to that case and integrating semiring-based constraint solving in the Constraint L...
متن کاملConstraint Programming for Modelling and Solving Modal Satisfiability
We explore to what extent and how efficiently constraint programming can be used in the context of automated reasoning for modal logics. We encode modal satisfiability problems as constraint satisfaction problems with non-boolean domains, together with suitable constraints. Experiments show that the approach is very promising.
متن کاملEncoding global constraints in semiring-based constraint solving
In recent works, a general framework for constraint satisfaction over nite domains has been proposed, based on the concept of semiring-valued constraints. Classical CSPs, fuzzy CSPs, hierachical CSPs can be easily cast in this general framework. In this paper, we claim that translating any constraint problem into a semiring-based constraint problem makes it possible to express global in-formati...
متن کاملSemiring-based Constraint Logic Programming
We extend the Constraint Logic Programming (CLP) formalism in order to handle semiringbased constraint systems. This allows us to perform in the same language both constraint solving and optimization. In fact, constraint systems based on semirings are able to model both classical constraint solving and more sophisticated features like uncertainty, probability, fuzzyness, and optimization. We th...
متن کاملConstraint Programming for Modelling and Solving Modal Satisfability
We explore to what extent and how efficiently constraint programming can be used in the context of automated reasoning for modal logics. We encode modal satisfiability problems as constraint satisfaction problems with non-boolean domains, together with suitable constraints. Experiments show that the approach is very promising.
متن کامل